FSBC: fast string-based clustering for HT-SELEX data
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملAptaGUI—A Graphical User Interface for the Efficient Analysis of HT-SELEX Data
To the Editor: Revolutionizing the traditional Systematic Evolution of Ligands by EXponential Enrichment (SELEX), high-throughput SELEX (HT-SELEX) has become the method of choice for the identification of aptamers—synthetic, single-stranded (ribo)nucleic molecules that bind to a given molecular target. 1 In contrast to traditional SELEX, in which only data from the last selection cycle is obtai...
متن کاملA Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملAn improved HT Algorithm based clustering for Multi-objective Detection
This paper describes a new Hough transform (HT) algorithm for multi-objective detection. The core principle of HT—voting principle, which needs to find the maximal voting rate, makes HT impossible to detect many targets from single image synchronously. An improved HT algorithm based on clustering is presented. When the number of targets in the image is known, all of targets can be detected once...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2020
ISSN: 1471-2105
DOI: 10.1186/s12859-020-03607-1